Soft-decision decoding of linear block codes using efficient iterative G-space encodings
نویسندگان
چکیده
منابع مشابه
H PRASHANTHA KUMAR et. al.: STACK DECODING OF LINEAR BLOCK CODES FOR DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM
The boundaries between block and convolutional codes have become diffused after recent advances in the understanding of the trellis structure of block codes and the tail-biting structure of some convolutional codes. Therefore, decoding algorithms traditionally proposed for decoding convolutional codes have been applied for decoding certain classes of block codes. This paper presents the decodin...
متن کاملEfficient Maximum-Likelihood Soft-Decision Decoding of Linear Block Codes Using Algorithm A
In this report we present a novel and efficient maximum-likelihood soft-decision decoding algorithm for linear block codes. The approach used here is to convert the decoding problem into a search problem through a graph which is a trellis for an equivalent code of the transmitted code. Algorithm A*, which uses a priority-first search strategy, is employed to search through this graph. This sear...
متن کاملEfficient priority-first search maximum-likelihood soft-decision decoding of linear block codes
In this paper we present a novel and efficient maximum-likel ihood soft-decision decoding algorithm for linear block codes. The approach used here converts the decoding problem into a search problem through a graph that is a trellis for an equivalent code of the transmitted code. A general ized Dijkstra’s Algorithm, which uses a priority-first search strategy, is employed to search through this...
متن کاملA Soft Decoding of Linear Block Codes by Genetic Algorithms
Abstract— In this paper, we present a hard-decision decoding technique based on Genetic Algorithms (HDGA), which is applicable to the general case where the only known structure is given by the generating matrix G. We also present a new soft-decision decoding based on HDGA and the Chase algorithm (SDGA). The simulations, applied on some binary Linear Block Codes, show that the genetic decoder h...
متن کاملMaximum-likelihood Soft-decision Decoding for Binary Linear Block Codes Based on Their Supercodes
Based on the notion of supercodes, we propose a two-phase maximum-likelihood soft-decision decoding (tpMLSD) algorithm for binary linear block codes in this work. The first phase applies the Viterbi algorithm backwardly to a trellis derived from the parity-check matrix of the supercode of the linear block code. Using the information retained from the first phase, the second phase employs the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001